Deciding Associativity for Partial Multiplication Tables of Order 3 *
نویسندگان
چکیده
The associativity problem for the class of finite multiplication tables is known to be undecidable, even for quite narrow infinite subclasses of tables. We present criteria which can be used to decide associativity in many cases, although any effective method based on such criteria must eventually fail on a table of some size (as otherwise decidability for the general class would follow). By means of an extensive computer search we have been able to use the criteria successfully to solve the associativity problem for all tables of order up to 3. We find 24,733 associative tables and 237,411 nonassociative tables, and present some further statistics about how "deep" we had to search to establish the nonassociativity of a table. We also prove that there are tables of order 3 for which no "one-mountain" theorem holds (which was known previously only for order 6 examples). Our methods make use of efficient data-representations and techniques of heuristic and adaptive programming.
منابع مشابه
Partial monoids: associativity and confluence
A partial monoid P is a set with a partial multiplication × (and total identity 1P ) which satisfies some associativity axiom. The partial monoid P may be embedded in the free monoid P ∗ and the product × is simulated by a string rewriting system on P ∗ that consists in evaluating the concatenation of two letters as a product in P , when it is defined, and a letter 1P as the empty word ǫ. In th...
متن کاملReconstruction of Group Multiplication Tables by Quadrangle Criterion
For n > 3, every n×n partial Cayley matrix with at most n−1 holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result. Reconstruction of other types of multiplication tables is discussed.
متن کاملA Comparative Evaluation of the Sub-sectors' Linkages of Iran's Economy in the Last Five Decades: The Hybrid Approach of Input-Output Tables and Cross-Impact Matrix Multiplication Applied to Classification (MICMAC)
In this paper, the hybrid modeling of Input-Output framework and MICMAC technique have been used to evaluates the inter-sectoral interactions between all sectors and activities of Iran’s economy based on the statistics aggregate Input-Output tables for five periods from 1973 to 2011. The main 15 sectors are elaborated and the results of the interactions were used to extract sectoral prioriti...
متن کاملA Quick Introduction to Operads
Operads (or at least An and En operads, which is what we’ll focus on) are a formalism for discussing various degrees to which associativity and commutativity can fail. Suppose I have a space X with a multiplication μ : X ×X → X that is not associative. In particular, μ(−, μ(−,−)) and μ(μ(−,−),−) are two different ternary operations. One approach is to consider a space O(3) of ternary operations...
متن کامل3 Polynomial Rings
A ring is a set R with two binary operations usually called addition, denoted as +, and multiplication, denoted as ·, such that (R, +) satisfies the five axioms of closure, associativity, commutativity, identity element (called zero, 0), and inverse element; and (R, ·) satisfies the three axioms of closure, associativity, and identity element (called one, 1). Furthermore, multiplication (·) dis...
متن کامل